On stability of some lexicographic integer optimization problem
نویسندگان
چکیده
A lexicographic integer optimization problem with criteria represented by absolute values of linear functions is considered. Five types of stability for the set of lexicographic optima under small changes of the parameters of the vector criterion are investigated.
منابع مشابه
Stability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem
Lower bounds of stability, pseudostability and quasistability radii of lexicographic set in vector combinatorial problem on systems of subsets of finite set with partial criteria of more general kinds have been found. Many specialists are engaged in study of stability of discrete optimization problems to perturbations of their parameters (see [1-3]). Need for investigation of stability of optim...
متن کاملNumerical measure of strong stability and strong quasistability in the vector problem of integer linear programming
In this paper we consider a vector integer programming problem with the linear partial criteria. Numerical evaluations of two types of stability of the Pareto set have been found. Usually the stability (quasistability) of a vector optimization problem (see [1-10]) is understood as the property of nonappearance of new optimal solutions (preservation of initial) under small perturbations of the p...
متن کاملLexicographic goal programming approach for portfolio optimization
This paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. The mean variance model of portfolio optimization that was introduced by Markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, S&P star ranking and return in later years which is ...
متن کاملStability Analysis for a Multicriteria Problem with Linear Criteria and Parameterized Principle of Optimality “from Lexicographic to Slater“
A multicriteria linear programming problem with integer variables and parameterized optimality principle ”from lexicographic to Slater” is considered. A situation in which initial coefficients of penalty cost functions are not fixed but may be potentially a subject to variations is studied. For any efficient solution, appropriate measures of the quality are introduced which incorporate informat...
متن کاملBoolean Lexicographic Optimization
Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints. This paper develops and evaluates algorithms for solving MOCO problems, defined on Boolean domains, and where the optimality criterion is lexicographic. The proposed algorithms build on existing algorithms for either Maximum S...
متن کامل